- heap of trees
- завал
Англо-русский словарь по деревообрабатывающей промышленности. 2013.
heap of trees
Смотреть что такое "heap of trees" в других словарях:
Heap (data structure) — This article is about the programming data structure. For the dynamic memory area, see Dynamic memory allocation. Example of a complete binary max heap In computer science, a heap is a specialized tree based data structure that satisfies the heap … Wikipedia
Binomial heap — In computer science, a binomial heap is a heap similar to a binary heap but also supporting the operation of merging two heaps quickly. This is achieved by using a special tree structure. It is important as an implementation of the mergeable heap … Wikipedia
Fibonacci heap — In computer science, a Fibonacci heap is a heap data structure consisting of a forest of trees. It has a better amortized running time than a binomial heap. Fibonacci heaps were developed by Michael L. Fredman and Robert E. Tarjan in 1984 and… … Wikipedia
d-ary heap — The d ary heap or d heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2.[1][2][3] Thus, a binary heap is a 2 heap. According to Tarjan[2] and Jensen et al … Wikipedia
Binary heap — Example of a complete binary max heap Example of a complete binary min heap A binary … Wikipedia
Slag heap — A slag heap (also called bing, Boney piles, culm, waste coal, Terekons (Russian), gob piles, or slate dumps) is a pile built of accumulated tailings, which are by products of mining. These waste materials are mostly composed of shale, as well as… … Wikipedia
D-ary heap — The d ary heap or d heap is a generalization of the binary heap data structure whose non leaf nodes have d children, instead of 2.According to Jensen et al. [cite journal |title=An extended truth about heaps |author=Jensen |coauthors=Katajainen;… … Wikipedia
AF-heap — In computer science, the AF heap was a proposal by M. L. Fredman and D. E. Willard [M. L. Fredman and D. E. Willard. Trans dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences 48, 533 551… … Wikipedia
Tree bog — A Treebog is a form of compost toilet which has willows, nettles and other nutrient hungry plants planted around it. The faeces are held in a chamber open to the air which allows it to decompose rapidly, feeding the trees around it. Unlike a… … Wikipedia
List of Biblical names — This is a list of names from the Bible, mainly taken from the 19th century public domain resource: : Hitchcock s New and Complete Analysis of the Holy Bible by Roswell D. Hitchcock, New York: A. J. Johnson, 1874, c1869.Each name is given with its … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
